#include <cmath>
#include <ctime>
#include <iostream>

long long add1(int n) {
    long long sum = 0;
    for (int i = 1; i <= n; i++) {
        sum += i;
    }
    return sum;
}

long long add2(int n) {
    long long ret = n;
    return (ret + 1) * ret / 2;
}

void test1() {
    int n = 0;
    std::cin >> n;
    clock_t t1 = clock();
    std::cout << "s1: " << add1(n);
    t1 = clock() - t1;
    std::cout << " " << t1 << std::endl;
    clock_t t2 = clock();
    std::cout << "s2: " << add2(n);
    t2 = clock() - t2;
    std::cout << " " << (float)t2 / CLOCKS_PER_SEC << std::endl;
}

// ...

double log2(double n) {
    return log10(n) / log10(2);
}

long expo(int n) {
    long ret = 1;
    for (int i = 0; i < n; i++) {
        ret *= 2;
    }
    return ret;
}

long fact(int n) {
    long ret = 1;
    for (int i = n; i > 0; i--) {
        ret *= i;
    }
    return ret;
}

void fun(int n) {
    printf("%5.2lf ", log2(n));
    printf("%5.2lf ", sqrt(n));
    printf("%5d ", n);
    printf("%5.2f ", n * log2(n));
    printf("%7d ", n * n);
    printf("%7d ", n * n * n);
    printf("%7d ", expo(n));
    printf("%10d\n", fact(n));
}

void test2() {
    int n = 0;
    std::cin >> n;
    std::cout << "log2(n) sqrt(n) n nlog2(n) n^2      n^3      2^n      n!" << std::endl;
    for (int i = 1; i <= n; i++) {
        fun(i);
    }
}

int main() {
    // test1();
    test2();
    return 0;
}